Encoding hybridized institutions into first-order logic

نویسندگان

  • Razvan Diaconescu
  • Alexandre Madeira
چکیده

A ‘hybridisation’ of a logic, referred to as the base logic, consists of developing the characteristic features of hybrid logic on top of the respective base logic, both at the level of syntax (i.e. modalities, nominals, etc.) and of the semantics (i.e. possible worlds). By ‘hybridised institutions’ we mean the result of this process when logics are treated abstractly as institutions (in the sense of the institution theory of Goguen and Burstall). This work develops encodings of hybridised institutions into (many-sorted) first order logic (abbreviated FOL) as a ‘hybridisation’ process of abstract encodings of institutions into FOL, which may be seen as an abstraction of the well known standard translation of modal logic into first order logic. The concept of encoding employed by our work is that of comorphism from institution theory, which is a rather comprehensive concept of encoding as it features encodings both of the syntax and of the semantics of logics/institutions. Moreover we consider the so-called theoroidal version of comorphisms that encode signatures to theories, a feature that accommodates a wide range of concrete applications. Our theory is also general enough to accommodate various constraints on the possible worlds semantics as well a wide variety of quantifications. We also provide pragmatic sufficient conditions for the conservativity of the encodings to be preserved through the hybridisation process, which provides the possibility to shift a formal verification process from the hybridised institution to FOL.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Encoding TLA+ set theory into many-sorted first-order logic

We present an encoding of Zermelo-Fraenkel set theory into many-sorted first-order logic, the input language of state-of-the-art smt solvers. This translation is the main component of a back-end prover based on smt solvers in the TLA Proof System.

متن کامل

Logic-Based Electronic Institutions

We propose a logic-based rendition of electronic institutions – these are means to specify open agent organisations. We employ a simple notation based on first-order logic and set theory to represent an expressive class of electronic institutions. We also provide a formal semantics to our constructs and present a distributed implementation of a platform to enact electronic institutions specifie...

متن کامل

Hybridization of Institutions

Modal logics are successfully used as specification logics for reactive systems. However, they are not expressive enough to refer to individual states and reason about the local behaviour of such systems. This limitation is overcome in hybrid logics which introduce special symbols for naming states in models. Actually, hybrid logics have recently regained interest, resulting in a number of new ...

متن کامل

Some New Strategies for Theorem-Proving in First Order Logic with Equality

A method for encoding formulas in rst-order logic with equality into some equational logics and their associated propositional logics is presented. This yields some new strategies for theorem-proving in rst-order logic with equality. We outline the techniques and give a simple illustration of their use.

متن کامل

Encoding TLA ^+ + into Many-Sorted First-Order Logic

This paper presents an encoding of a non-temporal fragment of the TLA language, which includes untyped set theory, functions, arithmetic expressions, and Hilbert’s ε operator, into many-sorted firstorder logic, the input language of state-of-the-art smt solvers. This translation, based on encoding techniques such as boolification, injection of unsorted expressions into sorted languages, term re...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Mathematical Structures in Computer Science

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2016